On Covering Equivalence 3
نویسندگان
چکیده
An arithmetic sequence a(n) = {a+nx : x ∈ Z} (0 6 a < n) with weight λ ∈ C is denoted by 〈λ, a, n〉. For two finite systems A = {〈λs, as, ns〉}s=1 and B = {〈μt, bt,mt〉}t=1 of such triples, if ∑ ns|x−as λs = ∑ mt|x−bt μt for all x ∈ Z then we say that A and B are covering equivalent. In this paper we characterize covering equivalence in various ways, our characterizations involve the Γ-function, the Hurwitz ζ-function, trigonometric functions, the greatest integer function and Egyptian fractions.
منابع مشابه
On the Equivalence Covering Number of Splitgraphs
An equivalence graph is a disjoint union of cliques. For a graph G let eq(G) be the minimum number of equivalence subgraphs of G needed to cover all edges of G. We call eq( G) the equivalence covering number of G. It was shown in [ 81 that computing the equivalence covering number is NP-hard, even when restricted to graphs in which no two triangles have a vertex in common. We show that the equi...
متن کاملON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملPricing Unemployment Insurance in Iran
Abstract Employees always concern about losing their job, or in other word, losing their income resources. For this purpose, governments require strong protection system for covering these concerns. The Unemployment Insurance (UI) program’s can be used for achieving this goal. Based on article five of Iranian unemployment Insurance law, premium is four percent of employee’s salary while emplo...
متن کاملIrreducibility on General Fuzzy Automata
The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.
متن کاملEfficient Verification of Equivalence Classes and Simultaneous Testing Using Two-layer Covering Arrays
This short paper introduces a method for verifying equivalence classes for module/unit testing. This is achieved using a two-layer covering array, in which some or all values of a primary covering array represent equivalence classes. A second layer covering array of the equivalence class values is computed, and its values substituted for the equivalence class names in the primary array. It is s...
متن کامل